Digital Signatures from Strong RSA without Prime Generation
نویسندگان
چکیده
We construct a signature scheme that is proved secure, without random oracles, under the strong RSA assumption. Unlike other efficient strong-RSA based schemes, the new scheme does not generate large prime numbers during signing. The public key size and signature size are competitive with other strong RSA schemes, but verification is less efficient. The new scheme adapts the prefix signing technique of Hohenberger and Waters (CRYPTO 2009) to work without generating primes.
منابع مشابه
Short Signatures Without Random Oracles
We describe a short signature scheme which is existentially unforgeable under a chosen message attack without using random oracles. The security of our scheme depends on a new complexity assumption we call the Strong Diffie-Hellman assumption. This assumption has similar properties to the Strong RSA assumption, hence the name. Strong RSA was previously used to construct signature schemes withou...
متن کاملShort Signatures from Weaker Assumptions
We provide constructions of (m, 1)-programmable hash functions (PHFs) for m ≥ 2. Mimicking certain programmability properties of random oracles, PHFs can, e.g., be plugged into the generic constructions by Hofheinz and Kiltz (J. Cryptol. 2011) to yield digital signature schemes from the strong RSA and strong q-Diffie-Hellman assumptions. As another application of PHFs, we propose new and effici...
متن کاملVoting With a Tripartite Designated Verifier Scheme Based On Threshold RSA Signatures
In this paper we propose a new voting scheme that provides a receipt to each voters. The receipt is build in a way that prevents that the vote can be revealed to third entities other than a judge. The scheme is based on the concept of strong designated verifier signature scheme and threshold RSA signatures. The signing key size remains bounded by the size of a RSA modulus. The computational cos...
متن کاملNew Online/Offline Signature Schemes Without Random Oracles
In this paper, we propose new signature schemes provably secure under the strong RSA assumption in the standard model. Our proposals utilize Shamir-Tauman’s generic construction for building EFCMA secure online/offline signature schemes from trapdoor commitments and less secure basic signature schemes. We introduce a new natural intractability assumption for hash functions, which can be interpr...
متن کاملA Survey of ESIGN: State of the Art and Proof of Security
RSA, ESIGN, cryptography, digital signature, encryption, decryption, factoring RSA [1] generates digital signatures and cipher text, S, by performing exponentiation on a message, M, to the e-th power of the form M mod(n), where n is based on large prime numbers. RSA has been proven to be fundamentally secure, given the complexity of the e-th root mod(n) problem that RSA presents. Unfortunately,...
متن کامل